Scalability and Granularity Issues of the Hierarchical Radiosity Method
نویسندگان
چکیده
The radiosity method is a global illumination method from computer graphics to visualize light in scenes of diiuse objects within an enclosure. The hierarchical radiosity method reduces the problem size considerably but results in a highly irregular algorithm which makes a parallel implementation more diicult. We investigate a task-oriented shared memory implementation and present optimizations with diier-ent eeects concerning locality and granularity properties. As execution platform we use the SB-PRAM, a shared-memory machine with uniform memory access time, which allows us to concentrate on load balancing and scalability issues.
منابع مشابه
A Shared - Memory Implementation of theHierarchical
The radiosity method is a simulation method from computer graphics to visualize the global illumination in scenes containing diiuse objects within an enclosure. A variety of realizations (including parallel approaches) were proposed to achieve a high eeciency while guaranteeing the same accuracy of the graphical representation. The hierarchical radiosity method reduces the computational costs c...
متن کاملHIRAD: A Hierarchical Higher Order Radiosity Implementation
In this paper we describe our hierarchical higher order radiosity implementation, called HIRAD. We present a number of improvements to the original wavelet radiosity method: We propose new basis functions for (convex) quadrilaterals and for triangles offering finer granularity than the usual product-1D bases, a new refinement criterion for hierarchical refinement and a very general strategy for...
متن کاملHierarchical level of detail optimization for constant frame rate rendering of radiosity scenes
The predictive hierarchical level of detail optimization algorithm of Mason and Blake is experimentally evaluated in the form of a practical application to hierarchical radiosity. In a novel approach the recursively subdivided patch hierarchy generated by a perceptually refined hierarchical radiosity algorithm is treated as a hierarchical level of detail scene description. In this way we use th...
متن کاملSpatial Partitioning for Parallel Hierarchical Radiosity on Distributed Memory Architectures
This paper presents an efficient, highly scalable implementation of the Hierarchical Radiosity Algorithm. We present a clever mapping of Hierarchical Radiosity to high-dimensional spaces that manifests a locality property, which can greatly reduce communication on parallel distributed memory architectures. We use a very simple dynamic spatial partitioning method to keep the mapping balanced. We...
متن کاملAutomatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a “standard” hierarchical radiosity algorithm with clustering, but the rapid illumination variations over some large regions receiving complex shadows are computed on the fly using an efficient convolution operation, and displayed as textures. This a...
متن کامل